Search in Temporal Domains

Best-rst search algorithms have been widely used to nd a minimum cost path in graph search. To formulate certain problems involving temporal events, it is at times instrumental to use graphs whose edge costs are time-dependent. In such a graph, shortest paths are dependent on time at which traversal in the graph begins. Typically, structural changes in t occur at discrete points in t, where t is the shortest path with start time t. In this paper, a best-rst algorithm is generalized to handle time-dependent graphs to nd shortest paths together with their start time characteristics and some properties of the algorithm are investigated.